Random Tie-breaking with Stochastic Dominance
نویسنده
چکیده
Consider Plurality with random tie-breaking. This paper uses standard axiomatic extensions of preferences over elements to preferences over sets (Kelly, Gardenfors, Responsiveness) to characterize all better-replies of a voter under stochastic dominance.
منابع مشابه
Strategy-proof stochastic assignment
I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is ...
متن کاملOF CAMBRIDGE Cambridge Working Papers in Economics
I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is ...
متن کاملElectronic Companion to: What matters in school choice tie-breaking? How competition guides design
We break Theorem 3.2 into several smaller (sub-)theorems and prove each one separately. This is done in sections 1.1, 1.2, and 1.3, which state and discuss the theorems about stochastic dominance, Pareto improving pairs, and variance, respectively. The theorems stated in these sections are then proved separately in the later sections. Section 2 contains the proofs for stochastic dominance. Sect...
متن کاملHow to Do Tie-breaking in Prioritization of Interaction Test Suites?
The prioritization of interaction test suites has received more attention in the field of combinatorial interaction testing, especially when testing resources are limited to allow the part of combinatorial test cases to be executed. Many strategies have been proposed to prioritize interaction test suites according to different evaluation measures. However, most of these strategies may face a ch...
متن کاملTies Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote
We study the impact on strategic voting of tie-breaking by means of considering the order of tied candidates within a random vote. We compare this to another non-deterministic tie-breaking rule where we simply choose candidate uniformly at random. In general, we demonstrate that there is no connection between the computational complexity of computing a manipulating vote with the two different t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1609.01682 شماره
صفحات -
تاریخ انتشار 2016